K-NEAREST NEIGHBORS METHOD FOR PREDICTION OF FUEL CONSUMPTION IN TRACTOR-CHISEL PLOW SYSTEMS
نویسندگان
چکیده
منابع مشابه
Predicting Tractor Fuel Consumption
Reports from the Nebraska Tractor Test Laboratory (NTTL) show improved fuel efficiency during the past 20 years. A 4.8% decrease in average annual specific volumetric fuel consumption for the data used in theASAE Standards was shown. Using fuel consumption and power data from the NTTL reports, new equations for fuel consumption were established that predict fuel consumption for diesel engines d...
متن کاملestimation of the fuel consumption rate of tractor due to different aspect ratios of chisel plow blade
the purpose of this research was to study and predict fuel consumption rate of tractor due to different aspect ratios of chisel plow blade and to determine a general relationship equation between aspect ratio ( ) and fuel consumption rate. an itm-399 (81 kw) tractor and a mounted-type chisel plow with 9 shanks were used. the 5 and 10 cm width chisel blades were used. the experiments were condu...
متن کاملDiesel Fuel Consumption During Chisel Plowing
Introduction Direct energy expenses (diesel, gasoline, propane, electricity) total more than $1 billion annually for Iowa farmers. Farm management techniques such as adjusting tractor gear and throttle settings or reducing tillage depths can reduce diesel fuel consumption for row crop production. This study is being conducted over multiple years to measure the effects of energy management techn...
متن کاملDiesel Fuel Consumption during Tractor Operations
Introduction Direct energy expenses (diesel, gasoline, propane, electricity) total more than $1 billion annually for Iowa’s farmers. Day-to-day farm management techniques such as adjusting tractor gear and throttle settings, making use of front-wheel-drive, and other strategies can reduce diesel fuel consumption for row crop production and general tractor operations. This study is being conduct...
متن کاملApproximate K Nearest Neighbors in High Dimensions
Given a set P of N points in a ddimensional space, along with a query point q, it is often desirable to find k points of P that are with high probability close to q. This is the Approximate k-NearestNeighbors problem. We present two algorithms for AkNN. Both require O(Nd) preprocessing time. The first algorithm has a query time cost that is O(d+logN), while the second has a query time cost that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engenharia Agrícola
سال: 2019
ISSN: 1809-4430,0100-6916
DOI: 10.1590/1809-4430-eng.agric.v39n6p729-736/2019